Transfinite Update Procedures for Predicative Systems of Analysis
نویسنده
چکیده
We present a simple-to-state, abstract computational problem, whose solution implies the 1consistency of various systems of predicative Analysis and offers a way of extracting witnesses from classical proofs. In order to state the problem, we formulate the concept of transfinite update procedure, which extends Avigad’s notion of update procedure to the transfinite and can be seen as an axiomatization of learning as it implicitly appears in various computational interpretations of predicative Analysis. We give iterative and bar recursive solutions to the problem. 1998 ACM Subject Classification F.4.1 Mathematical Logic
منابع مشابه
A Rapidly Convergent Nonlinear Transfinite Element Procedure for Transient Thermoelastic Analysis of Temperature-Dependent Functionally Graded Cylinders
In the present paper, the nonlinear transfinite element procedure recently published by the author is improved by introducing an enhanced convergence criterion to significantly reduce the computational run-times. It is known that transformation techniques have been developed mainly for linear systems, only. Due to using a huge number of time steps, employing the conventional time integration me...
متن کاملPredicative Functionals and an Interpretation of ID^_
In 1958 Gödel published his Dialectica interpretation, which reduces classical arithmetic to a quantifier-free theory T axiomatizing the primitive recursive functionals of finite type. Here we extend Gödel’s T to theories Pn of “predicative” functionals, which are defined using MartinLöf’s universes of transfinite types. We then extend Gödel’s interpretation to the theories of arithmetic induct...
متن کاملA Predicative Harmonization of the Time and Provable Hierarchies
A decidable transfinite hierarchy is defined by assigning ordinals to the programs of an imperative language. It singles out: the classes TIMEF(n) and TIMEF(nc); the finite Grzegorczyk classes at and above the elementary level, and the Σk-IND fragments of PA. Limited operators, diagonalization, and majorization functions are not used.
متن کاملPredicativism as a Philosophical Position1
Predicativity requirements of explicit presentability of objects and predicatively acceptable proof are distinguished from predicativist theses of a philosophical character. Familiar among these are expressions of skepticism about the objectivity of full power sets of infinite sets. Articulation of strong, limitative theses, however, turns out to be problematic: impredicative commitments creep ...
متن کاملFirst steps into metapredicativity in explicit mathematics
Metapredicativity is a new general term in proof theory which describes the analysis and study of formal systems whose proof-theoretic strength is beyond the Feferman-Schütte ordinal Γ0 but which are nevertheless amenable to purely predicative methods. Typical examples of formal systems which are apt for scaling the initial part of metapredicativity are the transfinitely iterated fixed point th...
متن کامل